Continuity properties of solution concepts for cooperative games
نویسندگان
چکیده
منابع مشابه
Bargaining Set Solution Concepts in Dynamic Cooperative Games
This paper is concerned with the question of defining the bargaining set, a cooperative game solution, when cooperation takes place in a dynamic setting. The focus is on dynamic cooperative games in which the players face (finite or infinite) sequences of exogenously specified TU-games and receive sequences of imputations against those static cooperative games in each time period. Two alternati...
متن کاملComputing cooperative solution concepts in coalitional skill games
We consider a simple model of cooperation among agents called Coalitional Skill Games (CSGs). This is a restricted form of coalitional games, where each agent has a set of skills that are required to complete various tasks. Each task requires a set of skills in order to be completed, and a coalition can accomplish the task only if the coalition’s agents cover the set of required skills for the ...
متن کاملThe Cooperative Solution of Stochastic Games
Building on the work of Nash, Harsanyi, and Shapley, we define a cooperative solution for strategic games that takes account of both the competitive and the cooperative aspects of such games. We prove existence in the general (NTU) case and uniqueness in the TU case. Our main result is an extension of the definition and the existence and uniqueness theorems to stochastic games discounted or und...
متن کاملOn the solution of cooperative games
Cooperative games are real-valued lattice functions quantifying the TU (transferable utility) worth of cooperation within a (finite) player set. A fundamental issue is how to share this worth amongst the players, i.e., the solution problem. Although cooperative games were originally conceived exclusively in terms of coalitional games, associating a worth to each coalition, later more complex ga...
متن کاملComplexity of stability-based solution concepts in multi-issue and MC-net cooperative games
MC-nets constitute a natural compact representation scheme for cooperative games in multiagent systems. In this paper, we study the complexity of several natural computational problems that concern solution concepts such as the core, the least core and the nucleolus. We characterize the complexity of these problems for a variety of subclasses of MC-nets, also considering constraints on the game...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations-Research-Spektrum
سال: 1987
ISSN: 0171-6468,1436-6304
DOI: 10.1007/bf01732645